InforLorV4, Main, Exploration, bibRecord, 001733

A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours

Identifieur interne : 001733 ( Main/Exploration ); précédent : 001732; suivant : 001734

A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours

Auteurs : Antoine Vacavant [France] ; Tristan Roussillon [France] ; Bertrand Kerautret [France] ; Jacques-Olivier Lachaud [France]

Source :

Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2013.

RBID : Pascal:13-0182220

Descripteurs français

Pascal (Inist)
- Vision ordinateur, Détection contour, Topologie, Géométrie algorithmique, Image numérique, Grille, Endommagement, Réalité terrain, Vectorisation, Segmentation, Rapport signal bruit, Recouvrement ensemble, Ensemble ordonné, Elagage, Estimation erreur, ., Algorithme irrégulier.

English descriptors

KwdEn :
- Computational geometry, Computer vision, Damaging, Digital image, Edge detection, Error estimation, Grid, Ground truth, Irregular Algorithm, Ordered set, Pruning(tree), Segmentation, Set covering, Signal to noise ratio, Topology, Vectorization.
mix :
- Irregular grids, Multi-scale noise detection, Noisy object analysis, Reeb graph.

Abstract

This paper proposes and evaluates a new method for reconstructing a polygonal representation from arbitrary digital contours that are possibly damaged or coming from the segmentation of noisy data. The method consists in two stages. In the first stage, a multi-scale analysis of the contour is conducted so as to identify noisy or damaged parts of the contour as well as the intensity of the perturbation. All the identified scales are then merged so that the input data is covered by a set of pixels whose size is increased according to the local intensity of noise. The second stage consists in transforming this set of resized pixels into an irregular isothetic object composed of an ordered set of rectangular and axis-aligned cells. Its topology is stored as a Reeb graph, which allows an easy pruning of its unnecessary spurious edges. Every remaining connected part has the topology of a circle and a polygonal representation is independently computed for each of them. Four different geometrical algorithms, including a new one, are reviewed for the latter task. These vectorization algorithms are experimentally evaluated and the whole method is also compared to previous works on both synthetic and true digital images. For fair comparisons, when possible, several error measures between the reconstruction and the ground truth are given for the different techniques.

Url:

https://hal.archives-ouvertes.fr/hal-00943821

Affiliations:

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours</title>
<author><name sortKey="Vacavant, Antoine" sort="Vacavant, Antoine" uniqKey="Vacavant A" first="Antoine" last="Vacavant">Antoine Vacavant</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Clermont Université, Université d'Auvergne, ISIT, BP10448</s1>
<s2>63000 Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>CNRS, UMR6284, BP10448</s1>
<s2>63000 Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Roussillon, Tristan" sort="Roussillon, Tristan" uniqKey="Roussillon T" first="Tristan" last="Roussillon">Tristan Roussillon</name>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>Université de Lyon, CNRS</s1>
<s2>Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Lyon</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="04"><s1>Université Lyon 2, LIRIS, UMR5205 CNRS</s1>
<s2>69676, Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Lyon</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kerautret, Bertrand" sort="Kerautret, Bertrand" uniqKey="Kerautret B" first="Bertrand" last="Kerautret">Bertrand Kerautret</name>
<affiliation wicri:level="4"><inist:fA14 i1="05"><s1>Université de Nancy, LORIA, UMR7503 CNRS</s1>
<s2>54506, Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
<orgName type="university">Nancy-Université</orgName>
</affiliation>
<affiliation wicri:level="4"><inist:fA14 i1="06"><s1>Université de Savoie, LAMA, UMR5127 CNRS</s1>
<s2>73376, Chambéry</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Chambéry</settlement>
</placeName>
<orgName type="university">Université Savoie Mont Blanc</orgName>
</affiliation>
</author>
<author><name sortKey="Lachaud, Jacques Olivier" sort="Lachaud, Jacques Olivier" uniqKey="Lachaud J" first="Jacques-Olivier" last="Lachaud">Jacques-Olivier Lachaud</name>
<affiliation wicri:level="4"><inist:fA14 i1="06"><s1>Université de Savoie, LAMA, UMR5127 CNRS</s1>
<s2>73376, Chambéry</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Chambéry</settlement>
</placeName>
<orgName type="university">Université Savoie Mont Blanc</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">13-0182220</idno>
<date when="2013">2013</date>
<idno type="stanalyst">PASCAL 13-0182220 INIST</idno>
<idno type="RBID">Pascal:13-0182220</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000081</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000926</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000080</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000080</idno>
<idno type="wicri:doubleKey">1077-3142:2013:Vacavant A:a:combined:multi</idno>
<idno type="wicri:Area/Main/Merge">001751</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00943821</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00943821</idno>
<idno type="wicri:Area/Hal/Corpus">000599</idno>
<idno type="wicri:Area/Hal/Curation">000599</idno>
<idno type="wicri:Area/Hal/Checkpoint">001185</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001185</idno>
<idno type="wicri:doubleKey">1077-3142:2013:Vacavant A:a:combined:multi</idno>
<idno type="wicri:Area/Main/Merge">001274</idno>
<idno type="wicri:Area/Main/Curation">001733</idno>
<idno type="wicri:Area/Main/Exploration">001733</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours</title>
<author><name sortKey="Vacavant, Antoine" sort="Vacavant, Antoine" uniqKey="Vacavant A" first="Antoine" last="Vacavant">Antoine Vacavant</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Clermont Université, Université d'Auvergne, ISIT, BP10448</s1>
<s2>63000 Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>CNRS, UMR6284, BP10448</s1>
<s2>63000 Clermont-Ferrand</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Auvergne-Rhône-Alpes</region>
<region type="old region" nuts="2">Auvergne (région administrative)</region>
<settlement type="city">Clermont-Ferrand</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Roussillon, Tristan" sort="Roussillon, Tristan" uniqKey="Roussillon T" first="Tristan" last="Roussillon">Tristan Roussillon</name>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>Université de Lyon, CNRS</s1>
<s2>Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Lyon</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="04"><s1>Université Lyon 2, LIRIS, UMR5205 CNRS</s1>
<s2>69676, Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Lyon</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kerautret, Bertrand" sort="Kerautret, Bertrand" uniqKey="Kerautret B" first="Bertrand" last="Kerautret">Bertrand Kerautret</name>
<affiliation wicri:level="4"><inist:fA14 i1="05"><s1>Université de Nancy, LORIA, UMR7503 CNRS</s1>
<s2>54506, Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
<orgName type="university">Nancy-Université</orgName>
</affiliation>
<affiliation wicri:level="4"><inist:fA14 i1="06"><s1>Université de Savoie, LAMA, UMR5127 CNRS</s1>
<s2>73376, Chambéry</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Chambéry</settlement>
</placeName>
<orgName type="university">Université Savoie Mont Blanc</orgName>
</affiliation>
</author>
<author><name sortKey="Lachaud, Jacques Olivier" sort="Lachaud, Jacques Olivier" uniqKey="Lachaud J" first="Jacques-Olivier" last="Lachaud">Jacques-Olivier Lachaud</name>
<affiliation wicri:level="4"><inist:fA14 i1="06"><s1>Université de Savoie, LAMA, UMR5127 CNRS</s1>
<s2>73376, Chambéry</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Auvergne-Rhône-Alpes</region>
<region type="old region">Rhône-Alpes</region>
<settlement type="city">Chambéry</settlement>
</placeName>
<orgName type="university">Université Savoie Mont Blanc</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
<imprint><date when="2013">2013</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational geometry</term>
<term>Computer vision</term>
<term>Damaging</term>
<term>Digital image</term>
<term>Edge detection</term>
<term>Error estimation</term>
<term>Grid</term>
<term>Ground truth</term>
<term>Irregular Algorithm</term>
<term>Ordered set</term>
<term>Pruning(tree)</term>
<term>Segmentation</term>
<term>Set covering</term>
<term>Signal to noise ratio</term>
<term>Topology</term>
<term>Vectorization</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Vision ordinateur</term>
<term>Détection contour</term>
<term>Topologie</term>
<term>Géométrie algorithmique</term>
<term>Image numérique</term>
<term>Grille</term>
<term>Endommagement</term>
<term>Réalité terrain</term>
<term>Vectorisation</term>
<term>Segmentation</term>
<term>Rapport signal bruit</term>
<term>Recouvrement ensemble</term>
<term>Ensemble ordonné</term>
<term>Elagage</term>
<term>Estimation erreur</term>
<term>.</term>
<term>Algorithme irrégulier</term>
</keywords>
<keywords scheme="mix" xml:lang="en"><term>Irregular grids</term>
<term>Multi-scale noise detection</term>
<term>Noisy object analysis</term>
<term>Reeb graph</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper proposes and evaluates a new method for reconstructing a polygonal representation from arbitrary digital contours that are possibly damaged or coming from the segmentation of noisy data. The method consists in two stages. In the first stage, a multi-scale analysis of the contour is conducted so as to identify noisy or damaged parts of the contour as well as the intensity of the perturbation. All the identified scales are then merged so that the input data is covered by a set of pixels whose size is increased according to the local intensity of noise. The second stage consists in transforming this set of resized pixels into an irregular isothetic object composed of an ordered set of rectangular and axis-aligned cells. Its topology is stored as a Reeb graph, which allows an easy pruning of its unnecessary spurious edges. Every remaining connected part has the topology of a circle and a polygonal representation is independently computed for each of them. Four different geometrical algorithms, including a new one, are reviewed for the latter task. These vectorization algorithms are experimentally evaluated and the whole method is also compared to previous works on both synthetic and true digital images. For fair comparisons, when possible, several error measures between the reconstruction and the ground truth are given for the different techniques.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Auvergne (région administrative)</li>
<li>Auvergne-Rhône-Alpes</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Rhône-Alpes</li>
</region>
<settlement><li>Chambéry</li>
<li>Clermont-Ferrand</li>
<li>Lyon</li>
<li>Nancy</li>
</settlement>
<orgName><li>Nancy-Université</li>
<li>Université Savoie Mont Blanc</li>
</orgName>
</list>
<tree><country name="France"><region name="Auvergne-Rhône-Alpes"><name sortKey="Vacavant, Antoine" sort="Vacavant, Antoine" uniqKey="Vacavant A" first="Antoine" last="Vacavant">Antoine Vacavant</name>
</region>
<name sortKey="Kerautret, Bertrand" sort="Kerautret, Bertrand" uniqKey="Kerautret B" first="Bertrand" last="Kerautret">Bertrand Kerautret</name>
<name sortKey="Kerautret, Bertrand" sort="Kerautret, Bertrand" uniqKey="Kerautret B" first="Bertrand" last="Kerautret">Bertrand Kerautret</name>
<name sortKey="Lachaud, Jacques Olivier" sort="Lachaud, Jacques Olivier" uniqKey="Lachaud J" first="Jacques-Olivier" last="Lachaud">Jacques-Olivier Lachaud</name>
<name sortKey="Roussillon, Tristan" sort="Roussillon, Tristan" uniqKey="Roussillon T" first="Tristan" last="Roussillon">Tristan Roussillon</name>
<name sortKey="Roussillon, Tristan" sort="Roussillon, Tristan" uniqKey="Roussillon T" first="Tristan" last="Roussillon">Tristan Roussillon</name>
<name sortKey="Vacavant, Antoine" sort="Vacavant, Antoine" uniqKey="Vacavant A" first="Antoine" last="Vacavant">Antoine Vacavant</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001733 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001733 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:13-0182220
   |texte=   A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours

A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.